Reasoning about Secure Interoperation Using Soft Constraints

نویسندگان

  • Stefano Bistarelli
  • Simon N. Foley
  • Barry O'Sullivan
چکیده

The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for systems to interoperate indirectly across network routes. Such interoperation has been shown to provide the potential for circuitous paths across a network that violate security. In this paper we propose a constraint-based framework for representing access control configurations of systems. The secure reconfiguration of a system is depicted as a constraint satisfaction problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trust-Based Constraint-Secure Interoperation for Dynamic Mediator-Free Collaboration

By collaboration, domains share resources effectively. To maintain security properties of individual domains during collaboration is a key issue. When domains employing heterogeneous RBAC policies collaborate via crossdomain role-role mappings, their locally-defined separation of duty constraints face the risk of breaching. We present the requirements for constraint-secure interoperation, prohi...

متن کامل

Computational Issues in Secure

| Advances in distributed systems and networking technology have made interoperation not only feasible but also increasingly popular. We deene the interoperation of secure systems and its security, and prove complexity and composability results on obtaining optimal and secure interoperation. Most problems are NP-complete even for systems with very simple access control structures, while for a g...

متن کامل

Hard and soft constraints for reasoning about qualitative conditional preferences

Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP...

متن کامل

The complexity and composability of secure interoperation

Advances in distributed systems and networking technology have made interoperation not only feasible but also increasingly popular. We deene the interop-eration of secure systems and its security, and prove complexity and composability results on obtaining optimal and secure interoperation. Most problems are NP-complete even for systems with very simple access control structures. Nevertheless, ...

متن کامل

A Requirements-Driven Trust Framework for Secure Interoperation in Open Environments

A key challenge in emerging multi-domain open environments is the need to establish trust-based, loosely coupled partnerships between previously unknown domains. An efficient trust framework is essential to facilitate trust negotiation based on the service requirements of the partner domains. While several trust mechanisms have been proposed, none address the issue of integrating the trust mech...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004